A transfer matrix approach to the enumeration of plane meanders
نویسنده
چکیده
A closed plane meander of order n is a closed self-avoiding curve intersecting an infinite line 2n times. Meanders are considered distinct up to any smooth deformation leaving the line fixed. We have developed an improved algorithm, based on transfer matrix methods, for the enumeration of plane meanders. While the algorithm has exponential complexity, its rate of growth is much smaller than that of previous algorithms. The algorithm is easily modified to enumerate various systems of closed meanders, semi-meanders, open meanders and many other geometries.
منابع مشابه
Enumerations of plane meanders
A closed plane meander of order n is a closed self-avoiding loop intersecting an infinite line 2n times. Meanders are considered distinct up to any smooth deformation leaving the line fixed. We have developed an improved algorithm, based on transfer matrix methods, for the enumeration of plane meanders. This allows us to calculate the number of closed meanders up to n = 24. The algorithm is eas...
متن کاملCritical exponents of plane meanders
Meanders form a set of combinatorial problems concerned with the enumeration of self-avoiding loops crossing a line through a given number of points, n. Meanders are considered distinct up to any smooth deformation leaving the line fixed. We use a recently developed algorithm, based on transfer matrix methods, to enumerate plane meanders. This allows us to calculate the number of closed meander...
متن کاملExact Meander Asymptotics: a Numerical Check
This note addresses the meander enumeration problem: “Count all topologically inequivalent configurations of a closed planar non self-intersecting curve crossing a line through a given number of points”. We review a description of meanders introduced recently in terms of the coupling to gravity of a two-flavored fully-packed loop model. The subsequent analytic predictions for various meandric c...
متن کاملFrom Fully-Packed Loops to Meanders: Exact Exponents
We address the meander problem “enumerate all topologically inequivalent configurations of a closed nonselfintersecting plane curve intersecting a given line through a fixed number of points”. We show that meanders may be viewed as the configurations of a suitable fully-packed loop statistical model defined on a random surface. Using standard results relating critical singularities of a lattice...
متن کاملNonlinear inelastic static analysis of plane frames with numerically generated tangent stiffness matrices
For the nonlinear analysis of structures using the well known Newton-Raphson Method, the tangent stiffness matrices of the elements must be constructed in each iteration. Due to the high expense required to find the exact tangent stiffness matrices, researchers have developed novel innovations into the Newton-Raphson method to reduce the cost and time required by the analysis. In this paper, a ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2000